On the extremal energy of integral weighted graphs
نویسندگان
چکیده
منابع مشابه
The extremal problems on the inertia of weighted bicyclic graphs
LetGw be a weighted graph. The number of the positive, negative and zero eigenvalues in the spectrum of Gw are called positive inertia index, negative inertia index and nullity of Gw, and denoted by i+(Gw), i−(Gw), i0(Gw), respectively. In this paper, sharp lower bound on the positive (resp. negative) inertia index of weighted bicyclic graphs of order n with pendant vertices is obtained. Moreov...
متن کاملOn the energy of non-commuting graphs
For given non-abelian group G, the non-commuting (NC)-graph $Gamma(G)$ is a graph with the vertex set $G$ $Z(G)$ and two distinct vertices $x, yin V(Gamma)$ are adjacent whenever $xy neq yx$. The aim of this paper is to compute the spectra of some well-known NC-graphs.
متن کاملthe eigenvalues and energy of integral circulant graphs
a graph is called textit{circulant} if it is a cayley graph on a cyclic group, i.e. its adjacency matrix is circulant. let $d$ be a set of positive, proper divisors of the integer $n>1$. the integral circulant graph $icg_{n}(d)$ has the vertex set $mathbb{z}_{n}$ and the edge set e$(icg_{n}(d))= {{a,b}; gcd(a-b,n)in d }$. let $n=p_{1}p_{2}cdots p_{k}m$, where $p_{1},p_{2},cdots,p_{k}$ are disti...
متن کاملNew results on the energy of integral circulant graphs
Circulant graphs are an important class of interconnection networks in parallel and distributed computing. Integral circulant graphs play an important role in modeling quantum spin networks supporting the perfect state transfer as well. The integral circulant graph ICGn(D) has the vertex set Zn = {0, 1, 2, . . . , n− 1} and vertices a and b are adjacent if gcd(a− b, n) ∈ D, where D ⊆ {d : d | n...
متن کاملEccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear and Multilinear Algebra
سال: 2012
ISSN: 0308-1087,1563-5139
DOI: 10.1080/03081087.2011.624094